Diclib.com
Dizionario ChatGPT

Ricerca nel dizionario Soluzioni personalizzate

Inserisci una parola o una frase in qualsiasi lingua 👆

Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

come viene usata la parola
frequenza di utilizzo
è usato più spesso nel discorso orale o scritto
opzioni di traduzione delle parole
esempi di utilizzo (varie frasi con traduzione)
etimologia

Cosa (chi) è nondeterministic automaton - definizione

Tree automata; Top-down tree automaton; Bottom-up tree automaton; Deterministic tree automaton; Deterministic finite tree automaton; Nondeterministic tree automaton; Nondeterministic finite tree automaton; DFTA; Tree language; Pumping lemma for regular tree languages

nondeterministic automaton

<theory> (Or "probabilistic automaton") An automaton in which there are several possible actions (outputs and next states) at each state of the computation such that the overall course of the computation is not completely determined by the program, the starting state, and the initial inputs. See also nondeterministic Turing Machine. (1996-05-07)

Generalized nondeterministic finite automaton

In the theory of computation, a generalized nondeterministic finite automaton (GNFA), also known as an expression automaton or a generalized nondeterministic finite state machine, is a variation of a

https://en.wikipedia.org/wiki/Generalized_nondeterministic_finite_automaton

Ω-automaton

VARIATION OF FINITE AUTOMATA THAT RUNS ON INFINITE, RATHER THAN FINITE, STRINGS AS INPUT

Rabin automaton; Parity automaton; Streett automaton; Omega automata; Omega automaton; Stream automaton; Ω-automata; Streett automata

In automata theory, a branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of finite automata that runs on infinite, rather than finite, strings as input. Since ω-automata do not stop, they have a variety of acceptance conditions rather than simply a set of accepting states.

https://en.wikipedia.org/wiki/Ω-automaton

Wikipedia

Tree automaton

A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines.

The following article deals with branching tree automata, which correspond to regular languages of trees.

As with classical automata, finite tree automata (FTA) can be either a deterministic automaton or not. According to how the automaton processes the input tree, finite tree automata can be of two types: (a) bottom up, (b) top down. This is an important issue, as although non-deterministic (ND) top-down and ND bottom-up tree automata are equivalent in expressive power, deterministic top-down automata are strictly less powerful than their deterministic bottom-up counterparts, because tree properties specified by deterministic top-down tree automata can only depend on path properties. (Deterministic bottom-up tree automata are as powerful as ND tree automata.)

https://en.wikipedia.org/wiki/Tree automaton